Open
Conversation
Implemented Bellman Ford's algorithm and function to find shortest path. Bellman Ford uses property passed in and supports weights of type int, float, and double. Implemented tests for Bellman Ford.
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
1 participant
Add this suggestion to a batch that can be applied as a single commit.This suggestion is invalid because no changes were made to the code.Suggestions cannot be applied while the pull request is closed.Suggestions cannot be applied while viewing a subset of changes.Only one suggestion per line can be applied in a batch.Add this suggestion to a batch that can be applied as a single commit.Applying suggestions on deleted lines is not supported.You must change the existing code in this line in order to create a valid suggestion.Outdated suggestions cannot be applied.This suggestion has been applied or marked resolved.Suggestions cannot be applied from pending reviews.Suggestions cannot be applied on multi-line comments.Suggestions cannot be applied while the pull request is queued to merge.Suggestion cannot be applied right now. Please check back later.
Added a member function of the graph class which implements the Bellman Ford's algorithm.
Another member function can then be called to find the shortest path to a given destination.
The property passed to the function is used as the algorithm's weight.
It supports weights of type int, float, and double.
Implemented tests for the algorithm. The output is manually verified using graphs with known shortest paths.